#define quickread
#ifdef quickread
#include <cstdio> 
template <typename T>
inline void read(T& x)
{
    int c=getchar(), f=1; x=0;
    while(c<'0'||'9'<c) {if(c=='-') f=-1; c=getchar();}
    while('0'<=c&&c<='9') 
        x=(x<<3)+(x<<1)+c-'0', c=getchar();
    x*=f;
}
template <typename T>
inline void quickwrite(T x)
{
    if(x<0) putchar('-'), x*=-1;
    if(x>=10) quickwrite(x/10);
    putchar(x%10+'0');
}
#else 
#include <iostream>
#endif
using namespace std;
#define DEBUG
const int N=510;
using ll=long long;
ll n, a[N], b[N][N];

void init()
{
    read(n);
}

void solve()
{
    init();
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            read(b[i][j]);
            if(i==j) a[i]=b[i][j];
        }
    for(int i=1; i<=n; i++) printf("%lld ", a[i]);
    puts("");

    for(int i=1; i<=n; i++)
        for(int j=i+1; j<=n; j++)
        {
            if((a[i]^a[j])==b[i][j]) printf("%lld %lld\n", i, j);
        }
    
}

// #undef DEBUG
signed main()
{
    #ifdef DEBUG
        freopen("../in.txt", "r", stdin);
        freopen("../out.txt", "w", stdout);
    #endif
    #ifndef quickread
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #endif

    int T=1; scanf("%d", &T);
    while(T--) 
    {
        solve();
    }
    return 0;
}
  